Network Connectivity Game

We investigate the cost allocation strategy associated with problem of providing service /communication between all pairs network nodes. There is a each link and communication any pair nodes can be delivered via paths connecting those The example efficient solution which could provide for node (non-rooted) minimum spanning tree. such should distributed among users who might have conflicting interests. objective this paper to formulate above as cooperative game, referred Network Connectivity (NC) develop stable scheme. NC game related Minimum Cost Spanning Tree games Shortest Path games. profound difference that in from some common source rest network, while there no established through two-way interaction participating construct an algorithm finds points core game. Finally, we discuss Egalitarian Allocation (ENCA) rule demonstrate it additional point.